Realizing tri-bimaximal mixing in minimal seesaw model with S4 family symmetry

In this Letter, we realize the tri-bimaximal mixing in the lepton sector in the context of minimal seesaw in which only two right-handed neutrinos are introduced, with the discrete group S4 as the family symmetry. In order to constrain the form of superpotential, a Z3 symmetry is also introduced. In the model, the mass matrices for charged leptons and right-handed neutrinos are diagonal. The unitary matrix that diagonalizes the light Majorana neutrino mass matrix is exact tri-bimaximal at LO, and is corrected by small quantities of O(0.01) at NLO. The mechanism to get the particular scalar VEV alignments used is also presented. Phenomenologically, the mass spectrum is of normal hierarchy with m₁=0, and ∑mi and |mee| are about 0.058 eV and 0.003 eV respectively.     

Cross-correlations in volume space: Differences between buy and sell volumes

We study the cross-correlations of buy and sell volumes on the Korean stock market in high frequency. We observe that the pulling effects of volumes are as small as that of returns. The properties of the correlations of buy and sell volumes differ. They are explained by the degree of synchronization of stock volumes. Further, the pulling effects on the minimal spanning tree are studied. In minimal spanning trees with directed links, the large pulling effects are clustered at the center, not uniformly distributed. The Epps effect of buy and sell volumes are observed. The reversal of the cross-correlations of buy and sell volumes is also detected.     

Existence and uniqueness of solutions of reaction–convection equations with non-Lipschitz nonlinearity

In this work we study single balance law _ut+∇⋅Φ(u)=f(u)$u_t+\mathrm{\nabla }\cdot \Phi (u)=f(u)$ with bounded initial value, and find that there may exist maximal and minimal solutions, if f(u)$f(u)$ is not Lipschitz continuous at u=0$u=0$. We also show that comparison principle is valid for such solutions, and the solutions may blow up or not under certain conditions. It is determined by the strength of source supply, as well as the competition between the source and flux.     

Traveling wave solutions in a diffusive system with two preys and one predator

This paper is concerned with the traveling wave solutions in a diffusive system with two preys and one predator. By constructing upper and lower solutions, the existence of nontrivial traveling wave solutions is established. The asymptotic behavior of traveling wave solutions is also confirmed by combining the asymptotic spreading with the contracting rectangles. Applying the theory of asymptotic spreading, the nonexistence of traveling wave solutions is proved.     

On the multidimensional extension of countermonotonicity and its applications

In a 2-dimensional space, Fréchet–Hoeffding upper and lower bounds define comonotonicity and countermonotonicity, respectively. Similarly, in the multidimensional case, comonotonicity can be defined using the Fréchet–Hoeffding upper bound. However, since the multidimensional Fréchet–Hoeffding lower bound is not a distribution function, there is no obvious extension of countermonotonicity in multidimensions. This paper investigates in depth a new multidimensional extension of countermonotonicity. We first provide an equivalent condition for countermonotonicity in 2-dimension, and extend the definition of countermonotonicity into multidimensions. In order to justify such extensions, we show that newly defined countermonotonic copulas constitute a minimal class of copulas. Two applications will be provided. First, we will study the relationships between multidimensional countermonotonicity and such well-known multivariate concordance measures as Kendall’s tau or Spearman’s rho. Second, we will give a financial interpretation of multidimensional countermonotonicity via the existing herd behavior index.     

Nonlinear force density method for the form-finding of minimal surface membrane structures

We develop an alternative approach for the form-finding of the minimal surface membranes (including cable membranes) using discrete models and nonlinear force density method. Two directed weighted graphs with 3 and 4-sided regional cycles, corresponding to triangular and quadrilateral finite element meshes are introduced as computational models for the form-finding problem. The triangular graph model is closely related to the triangular computational models available in the literature whilst the quadrilateral graph uses a novel averaging approach for the form-finding of membrane structures within the context of nonlinear force density method. The viability of the mentioned discrete models for form-finding are studied through two solution methods including a fixed-point iteration method and the Newton–Raphson method with backtracking. We suggest a hybrid version of these methods as an effective solution strategy. Examples of the formation of certain well-known minimal surfaces are presented whilst the results obtained are compared and contrasted with analytical solutions in order to verify the accuracy and viability of the suggested methods.     

A vertex incremental approach for maintaining chordality

For a chordal graph G=(V,E), we study the problem of whether a new vertex u∉V and a given set of edges between u and vertices in V can be added to G so that the resulting graph remains chordal. We show how to resolve this efficiently, and at the same time, if the answer is no, specify a maximal subset of the proposed edges that can be added along with u, or conversely, a minimal set of extra edges that can be added in addition to the given set, so that the resulting graph is chordal. In order to do this, we give a new characterization of chordal graphs and, for each potential new edge uv, a characterization of the set of edges incident to u that also must be added to G along with uv. We propose a data structure that can compute and add each such set in O(n) time. Based on these results, we present an algorithm that computes both a minimal triangulation and a maximal chordal subgraph of an arbitrary input graph in O(nm) time, using a totally new vertex incremental approach. In contrast to previous algorithms, our process is on-line in that each new vertex is added without reconsidering any choice made at previous steps, and without requiring any knowledge of the vertices that might be added subsequently.     

Dirac Quantization of t’Hooft-Polyakov Monopole Field: Axial Hamiltonization

In this article, we carry out the Hamiltonization in the axial gauge,of the t’Hooft-Polyakov monopole field outside the localized region, which represents the monopole’s core. One feature of the treatment here, is using the Higgs vacuum condition as both strong and weak equation instead of using it in the degree of freedom reduction.     

Computational efficiency analysis of Wu et al.’s fast modular multi-exponentiation algorithm

Very recently, for speeding up the computation of modular multi-exponentiation, Wu et al. presented a fast algorithm combining the complement recoding method and the minimal weight binary signed-digit representation technique. They claimed that the proposed algorithm reduced the number of modular multiplications from 1.503k to 1.306k on average, where the value k is the maximum bit-length of two exponents. However, in this paper, we show that their claim is unwarranted. We analyze the computational efficiency of Wu et al.’s algorithm by modeling it as a Markov chain. Our main result is that Wu et al.’s algorithm requires 1.471k modular multiplications on average.